Hybrid Evolutionary Approach for Multi-Objective Job-Shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
An algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملan algorithm for multi-objective job shop scheduling problem
scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...
متن کاملPareto-based Hybrid Multi-Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem
In this paper, flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid evolutionary algorithm is proposed to obtain a large set of Pareto-op...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملSingle Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem
A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial popula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaysian Journal of Computer Science
سال: 2007
ISSN: 0127-9084
DOI: 10.22452/mjcs.vol20no2.6